Shallow grates

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Thermal Process Simulation of Reactive Particles on Moving Grates

schnellere Rostgeschwindigkeit, eine kleinere Kühlluftmenge, einen geringeren Klinkerdurchsatz oder eine größere Partikelgröße vermieden werden. Abstract The moving grates, or travelling grates, are widely used in industries. For the purpose of product quality improvement (in quenching of clinker), energy consumption reduction (in pre-heating of limestone), emission control (in waste incinerati...

متن کامل

Shallow Semantics with Shallow Syntax

Assigning semantic roles to the constituents of a natural language sentence is an important first step in translating natural language into a logical form for further processing. I present a statistical classifier which can perform this task using minimal syntactic cues. I use the syntactic and the semantic head of each constituent as the only features and present simple rules for extracting th...

متن کامل

A “Shallow Phylogeny” of Shallow Barnacles (Chthamalus)

BACKGROUND We present a multi-locus phylogenetic analysis of the shallow water (high intertidal) barnacle genus Chthamalus, focusing on member species in the western hemisphere. Understanding the phylogeny of this group improves interpretation of classical ecological work on competition, distributional changes associated with climate change, and the morphological evolution of complex cirripede ...

متن کامل

Going Beyond Shallow Semantics

Shallow semantic analyzers, such as semantic role labeling and sense tagging, are increasing in accuracy and becoming commonplace. However, they only provide limited and local representations of local words and individual predicate-argument structures. This talk will address some of the current challenges in producing deeper, connected representations of eventualities. Available resources, such...

متن کامل

Shallow Dependency Pairs

We show how the dependency pair approach, commonly used to modularize termination proofs of rewrite systems, can be adapted to establish termination of recursive functions in a system like Isabelle/HOL or Coq. It turns out that all that is required are two simple lemmas about wellfoundedness.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 1994

ISSN: 0304-3975

DOI: 10.1016/0304-3975(94)90135-x